SLR inference: An inference system for fixed-mode logic programs, based on SLR parsing
نویسندگان
چکیده
منابع مشابه
Slr Inference : an Inference Systemfor Fixed - Mode Logic Programs , Based on Slr
Deenite-clause grammars (DCGs) generalize context-free grammars in such a way that Prolog can be used as a parser in the presence of context-sensitive information. Prolog's proof procedure, however, is based on back-tracking, which may be a source of ineeciency. Parsers for context-free grammars which use backtracking, for instance, were soon replaced by more eecient methods such as LR parsers....
متن کاملAutomatic Mode Inference for Logic Programs
In general, logic programs are undirected, i.e. there is no concept of ‘‘input’’ and ‘‘output’’ arguments to a procedure. An argument may be used either as an input or as an output argument, and programs may be executed either in a ‘‘forward’’ direction or in a ‘‘backward’’ direction. However, it is often the case that in a given program, a predicate is used with some of its arguments used cons...
متن کاملDeterminacy Inference for Logic Programs
This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most one answer and that answer is generated only once. The principal component of the technique is a goalindependent analysis of individual clauses. This derives a condition for a call that ensures only one clause in the m...
متن کاملConstraint-Based Inference in Probabilistic Logic Programs
A wide variety of models that combine logical and statistical knowledge can be expressed succinctly in the Probabilistic Logic Programming (PLP) paradigm. Specifically, models in standard statistical formalisms such as probabilistic graphical models (PGMs) (e.g. Bayesian Networks), can be easily encoded as PLP programs. For instance, Fig. 1(a) shows a program in PRISM, a pioneering PLP language...
متن کاملThe Computational SLR: A Logic for Reasoning about Computational Indistinguishability
Computational indistinguishability is a notion in complexity-theoretic cryptography and is used to define many security criteria. However, in traditional cryptography, proving computational indistinguishability is usually informal and becomes error-prone when cryptographic constructions are complex. This paper presents a formal proof system based on an extension of Hofmann’s SLR language, which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1998
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(96)00076-3